Research on Multi-Objective Minimum Spanning Tree Algorithm Based on Ant Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Research on Multi-Objective Minimum Spanning Tree Algorithm Based on Ant Algorithm

The ant algorithm is a branch of the artificial intelligence, which is developed from natural rules and of strong adaptability and expandability. Compared to other conventional algorithms, the algorithm has an unparalleled advantage that is demonstrated on combinatorial optimization problems through its application in the multi-objective minimum spanning tree.

متن کامل

Genetic algorithm approach on multi-criteria minimum spanning tree problem

Minimum Spanning Tree (MST) problem is of high importance in network optimization. The multi-criteria MST (mc-MST) is a more realistic representation of the practical problem in the real-world, but it is diicult for the traditional network optimization technique to deal with. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. Without neglecting its network ...

متن کامل

Fast Approximate Minimum Spanning Tree Algorithm Based on K-Means

It is difficult to apply traditional Minimum spanning tree(MST) algorithms to a large dataset since the time complexity of the algorithms is quadratic. In this paper, we present a fast approximate MST framework on the complete graph of N points, and any exact MST algorithm can be incorporated into the framework and speeded up. The proposed framework employs a divide-and-conquer scheme to produc...

متن کامل

A fast minimum spanning tree algorithm based on K-means

Article history: Received 14 June 2014 Received in revised form 25 September 2014 Accepted 3 October 2014 Available online 14 October 2014

متن کامل

ETEA: A Euclidean Minimum Spanning Tree-Based Evolutionary Algorithm for Multi-Objective Optimization

The Euclidean minimum spanning tree (EMST), widely used in a variety of domains, is a minimum spanning tree of a set of points in space where the edge weight between each pair of points is their Euclidean distance. Since the generation of an EMST is entirely determined by the Euclidean distance between solutions (points), the properties of EMSTs have a close relation with the distribution and p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Research Journal of Applied Sciences, Engineering and Technology

سال: 2013

ISSN: 2040-7459,2040-7467

DOI: 10.19026/rjaset.5.4396